Lattice polytopes cut out by root systems and the Koszul property
نویسنده
چکیده
We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes whose Minkowski sums are cut out by root systems. The proofs are based on a combinatorial characterization of diagonally split toric varieties.
منابع مشابه
Normal Polytopes, Triangulations, and Koszul Algebras
This paper is devoted to the algebraic and combinatorial properties of polytopal semigroup rings defined as follows. Let P be a lattice polytope in R n , i. e. a poly-tope whose vertices have integral coordinates, and K a field. Then one considers the embedding ι : R n → R n+1 , ι(x) = (x, 1), and defines S P to be the semigroup generated by the lattice points in ι(P); the K-algebra K[S P ] is ...
متن کاملOn the Unique-Lifting Property
We study the uniqueness of minimal liftings of cut generating functions obtained from maximal lattice-free polytopes. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polytopes. This generalizes a previous result by Basu, Cornuéjols and Köppe [3] for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question abou...
متن کاملNormality of cut polytopes of graphs is a minor closed property
Sturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this result, we have large classes of normal cut polytopes. Moreover, it turns out that, in order to study the conjecture, it is enough to consider 4-connected pl...
متن کاملLifting properties of maximal lattice-free polyhedra
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This generalizes a previous result by Basu, Cornuéjols and Köppe [BCK12] for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question ...
متن کاملJa n 20 06 BALANCED TRIANGULATIONS OF LATTICE POLYTOPES
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. Such triangulations are instrumental in deriving lower bounds for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile (Adv. Math., to appear). Special attention is paid to the cube case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008